Sofic equivalence relations

نویسندگان

  • Gábor Elek
  • Gábor Lippner
چکیده

We introduce the notion of sofic measurable equivalence relations. Using them we prove that Connes’ Embedding Conjecture as well as the Measurable Determinant Conjecture of Lück, Sauer and Wegner hold for treeable equivalence relations.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A new algebraic invariant for weak equivalence of sofic subshifts

It is studied how taking the inverse image by a sliding block code affects the syntactic semigroup of a sofic subshift. Two independent approaches are used: ζ-semigroups as recognition structures for sofic subshifts, and relatively free profinite semigroups. A new algebraic invariant is obtained for weak equivalence of sofic subshifts, by determining which classes of sofic subshifts naturally d...

متن کامل

The Syntactic Graph of a Sofic Shift Is Invariant under Shift Equivalence

We define a new invariant for shift equivalence of sofic shifts. This invariant, that we call the syntactic graph of a sofic shift, is the directed acyclic graph of characteristic groups of the non null regular D-classes of the syntactic semigroup of the shift.

متن کامل

On Flow Equivalence of Sofic Shifts

The flow equivalence of sofic shifts is examined using results about the structure of the corresponding covers. A canonical cover generalising the left Fischer cover to arbitrary sofic shifts is introduced and used to prove that the left Krieger cover and the past set cover of a sofic shift can be divided into natural layers. These results are used to find the range of a flow invariant and to i...

متن کامل

Ultraproducts of measure preserving actions and graph combinatorics

Ultraproducts of measure preserving actions of countable groups are used to study the graph combinatorics associated with such actions, including chromatic, independence and matching numbers. Applications are also given to the theory of random colorings of Cayley graphs and sofic actions and equivalence relations.

متن کامل

Full Groups and Soficity

First, we answer a question of Pestov, by proving that the full group of a sofic equivalence relation is a sofic group. Then, we give a short proof of the theorem of Grigorchuk and Medynets that the topological full group of a minimal Cantor homeomorphism is LEF. Finally, we show that for certain non-amenable groups all the generalized lamplighter groups are sofic.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2009